Primitive values of rational functions at primitive elements of a finite field
نویسندگان
چکیده
Given a prime power q and an integer n ? 2 , we establish sufficient condition for the existence of primitive pair ( ? f ) where ? F x is rational function degree sum . (Here = 1 / are coprime polynomials respectively, their degrees + .) For any such guaranteed to exist sufficiently large Indeed, when definitely does not only 28 values possibly (but unlikely) at most 3911 other
منابع مشابه
Primitive Roots in a Finite Field
with minimum m such that a(y) =0; 7 is said to belong to a(x). In particular if a(x) =xp" — x, Ore calls 7 a primitive root. It is easy to see that the two varieties of primitive roots are not identical; for example in the GF{21) defind by 04+0+l, 0 is a primitive root in the original sense but not in Ore's sense (since it belongs tox*-\-xi-\-x2-\-x). On the other hand it can be verified that 8...
متن کاملPrimitive Elements
Importantly, there is no element 1 ≤ k < p − 1 such that a ≡ 1(modp). The concepts presented in the study of primitive elements can be considered special cases of more general idea presented in group theory. Specifically, the primitve element a can be seen as a generator of Zp, we wil discuss this in more detail in the first section of the paper. Primitive elements also have applications in enc...
متن کاملOn primitive elements in finite fields of low characteristic
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, Fqn , small q and large n, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and ...
متن کاملFinding Primitive Elements in Finite Fields of Small Characteristic
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field with p elements. In time polynomial in p and n, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. Under a heuristic assumption, we argue that the algorithm does always succeed in finding a generator. The algorith...
متن کاملObservations on Primitive, Normal, and Subnormal Elements of Field Extensions
Let B1 and B2 be disjoint separable algebraic extensions of a field F, and let B = B1B2 be their composite. Let α1 be an element of B1 and α2 be an element of B2. Suppose α1 and α2 are primitive (resp. normal, resp. subnormal). We investigate the question of when α1 +α2 and α1α2 are necessarily primitive (resp. normal, resp. subnormal) elements of B. (A normal element of a Galois extension is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2021
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2020.09.017